Tolerances Induced by Irredundant Coverings
نویسندگان
چکیده
منابع مشابه
Tolerances Induced by Irredundant Coverings
In this paper, we consider tolerances induced by irredundant coverings. Each tolerance R on U determines a quasiorder .R by setting x .R y if and only if R(x) ⊆ R(y). We prove that for a tolerance R induced by a covering H of U , the covering H is irredundant if and only if the quasiordered set (U,.R) is bounded by minimal elements and the tolerance R coincides with the product &R ◦.R. We also ...
متن کاملMultiple vertex coverings by specified induced subgraphs
Given graphs H1, . . . ,Hk, let f(H1, . . . ,Hk) be the minimum order of a graph G such that for each i, the induced copies of Hi in G cover V (G). We prove constructively that f(H1,H2) ≤ 2(n(H1) + n(H2) − 2); equality holds when H1 = H2 = Kn. We prove that f(H1,Kn) = n + 2 √ δ(H1)n + O(1) as n → ∞. We also determine f(K1,m−1,Kn) exactly.
متن کاملVertex Coverings by Coloured Induced Graphs - Frames and Umbrellas
A graph G homogeneously embeds in a graph H if for every vertex x of G and every vertex y of H there is an induced copy of G in H with x at y. The graph G uniformly embeds in H if for every vertex y of H there is an induced copy of G in H containing y. For positive integer k, let fk(G) (respectively, gk(G)) be the minimum order of a graph H whose edges can be k-coloured such that for each colou...
متن کاملRough sets determined by tolerances
We show that for any tolerance R on U , the ordered sets of lower and upper rough approximations determined by R form ortholattices. These ortholattices are completely distributive, thus forming atomistic Boolean lattices, if and only if R is induced by an irredundant covering of U , and in such a case, the atoms of these Boolean lattices are described. We prove that the ordered set RS of rough...
متن کاملIrredundant Families of Subcubes
We consider the problem of finding the maximum possible size of a family of k-dimensional subcubes of the n-cube {0, 1}n, none of which is contained in the union of the others. (We call such a family ‘irredundant’). Aharoni and Holzman [1] conjectured that for k > n/2, the answer is ( n k ) (which is attained by the family of all k-subcubes containing a fixed point). We give a new proof of a ge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Informaticae
سال: 2015
ISSN: 0169-2968
DOI: 10.3233/fi-2015-1183